Graph coloring - PDFSEARCH.IO - Document Search Engine

Graph coloring
Results: 948

#	Item
151	Maximum Motif Problem in Vertex-Colored Graphs ? Riccardo Dondi1 , Guillaume Fertin2 , and St´ephane Vialette3 1 Add to Reading List Source URL: pagesperso.lina.univ-nantes.fr Language: English - Date: 2011-04-27 05:28:57 NP-complete problems Graph coloring Graph connectivity Combinatorial optimization Matching Vertex cover Bridge Color-coding Treewidth Neighbourhood Covering graph Incidence coloring
152	Spectral Graph Theory Lecture 4 Bounding Eigenvalues Daniel A. Spielman Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2015-08-17 14:43:26 Expander graph Graph coloring Min-max theorem Incidence coloring
153	Monochromatic triangles in two-colored plane V´ıt Jel´ınek Jan Kynˇcl Rudolf Stolaˇr ´ s Valla Tomaˇ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2007-02-02 08:52:54 Graph coloring NP-complete problems Monochromatic triangle E2
154	An Approximation Algorithm for Bounded Degree Deletion∗ Tom´aˇs Ebenlendr† Petr Kolman‡ Add to Reading List Source URL: kam.mff.cuni.cz Language: English - Date: 2009-06-04 05:35:50 NP-complete problems Functional analysis Vertex cover Distribution Graph coloring Dominating set Maximal independent set
155	c 2004 Cambridge University Press Combinatorics, Probability and Computing, 1–16. DOI: S0963548303005844 Printed in the United Kingdom Approximating the Number of Acyclic Orientations for a Class of Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2004-03-11 06:32:34 Graph coloring Polynomials Complexity classes Matroid theory Tutte polynomial Chromatic polynomial K-edge-connected graph Matroid Expander graph NC
156	Two Layer 3D Floor Planning Paul Horn∗ Gabor Lippner∗ October 16, 2012 Add to Reading List Source URL: web.cs.du.edu Language: English - Date: 2012-10-16 21:07:17 Tree Vertex Graph connectivity Graph operations Graph coloring NP-complete problems Pathwidth
157	Subgraph Search Over Massive Disk Resident Graphs Peng Peng1, Lei Zou1, Lei Chen2, Xuemin Lin3, and Dongyan Zhao1,4 1Peking University, 2Hong Kong University of Science and Technology, 3University of New South Wales, Add to Reading List Source URL: ssdbm2011.ssdbm.org Language: English - Date: 2011-09-01 19:29:54 Graph theory Graph Vertex Planar graphs Graph coloring NP-complete problems
158	Towards a Trichotomy for Quantified H-Coloring Barnaby Martin and Florent Madelaine Department of Computer Science, University of Durham, DH1 3LE, U.K. Abstract. Hell and Neˇsetˇril proved that Add to Reading List Source URL: www.bedewell.com Language: English - Date: 2009-11-10 10:57:00 Graph theory Graph coloring NP-complete problems Graph operations Graph homomorphism Morphisms Bipartite graph Graph Core Cycle Matching Bipartite double cover
159	tria-free-after-review14.dvi Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2012-04-30 01:42:59 NP-complete problems Graph operations Graph coloring Graph theory Line graph Clique Chordal graph Neighbourhood Planar graph Vertex Triangle-free graph Dominating set
160	The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders Is Polynomial George B. Mertzios School of Engineering and Computing Sciences, Durham University, UK Add to Reading List Source URL: community.dur.ac.uk Language: English - Date: 2013-07-11 20:53:15 NP-complete problems Graph coloring Bipartite graph Parity Comparability graph Matching Trapezoid graph Interval graph Graph Independent set Interval edge coloring Planar graph

UPDATE